A proposed method for on-board monitoring of discrete signals

On-board monitor of discrete signals of space vehicl

Search reduction in hierarchical distributed problem solving

Knoblock and Korf have determined that abstraction can reduce search at a single agent from exponential to linear complexity (Knoblock 1991; Korf 1987). We extend their results by showing how concurrent problem solving among multiple agents using abstraction can further reduce search to logarithmic complexity. We empirically validate our formal analysis by showing that it correctly predicts performance for the Towers of Hanoi problem (which meets all of the assumptions of the analysis). Furthermore, a powerful form of abstraction for large multiagent systems is to group agents into teams, and teams of agents into larger teams, to form an organizational pyramid. We apply our analysis to such an organization of agents and demonstrate the results in a delivery task domain. Our predictions about abstraction's benefits can also be met in this more realistic domain, even though assumptions made in our analysis are violated. Our analytical results thus hold the promise for explaining in general terms many experimental observations made in specific distributed AI systems, and we demonstrate this ability with examples from prior research.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/42828/1/10726_2005_Article_BF01384251.pd

Model-driven approach for supporting the mapping of parallel algorithms to parallel computing platforms

The trend from single processor to parallel computer architectures has increased the importance of parallel computing. To support parallel computing it is important to map parallel algorithms to a computing platform that consists of multiple parallel processing nodes. In general different alternative mappings can be defined that perform differently with respect to the quality requirements for power consumption, efficiency and memory usage. The mapping process can be carried out manually for platforms with a limited number of processing nodes. However, for exascale computing in which hundreds of thousands of processing nodes are applied, the mapping process soon becomes intractable. To assist the parallel computing engineer we provide a model-driven approach to analyze, model, and select feasible mappings. We describe the developed toolset that implements the corresponding approach together with the required metamodels and model transformations. We illustrate our approach for the well-known complete exchange algorithm in parallel computing. © 2013 Springer-Verlag

The Selective Vitamin D Receptor Activator for Albuminuria Lowering (VITAL) Study:Study Design and Baseline Characteristics

Background: Patients with diabetic nephropathy are at high risk for further progressive renal function loss. Treatments that decrease albuminuria have been linked with renal and cardiovascular protection. However, even when taking optimal treatment, residual renal and cardiovascular risk remains high which correlates with the magnitude of residual albuminuria. Use of vitamin D receptor activators, such as calcitriol and paricalcitol, is associated with improved survival. A small study with paricalcitol showed reductions in albuminuria. The VITAL study tests the hypothesis whether paricalcitol persistently reduces albuminuria in diabetic subjects already receiving angiotensin-converting enzyme inhibitor (ACEI) and/or angiotensin receptor blocker (ARB) therapy. Methods: Randomization in this double-blind trial is equal allocation to paricalcitol 1 mu/day, 2 mu g/day, or placebo. Inclusion criteria include: a diagnosis of type 2 diabetes, urinary albumin/creatinine ratio (UACR) between 100 3,000 mg/g, estimated glomerular filtration rate (eGFR) between 15-90 ml/min/1.73 m(2), serum calciu